Semiring-based Constraint Logic Programming
نویسندگان
چکیده
We extend the Constraint Logic Programming (CLP) formalism in order to handle semiringbased constraint systems. This allows us to perform in the same language both constraint solving and optimization. In fact, constraint systems based on semirings are able to model both classical constraint solving and more sophisticated features like uncertainty, probability, fuzzyness, and optimization. We then provide this class of languages with three equivalent semantics: model-theoretic, fixpoint, and proof-theoretic, in the style of CLP programs.
منابع مشابه
Compiling Semiring-Based Constraints with clp (FD, S)
In some recent works, a general framework for nite domains constraint satisfaction has been deened, where classical CSPs, fuzzy CSPs, weighted CSPs, partial CSPs and others can be easily cast. This framework, based on a semiring structure, allows, under certain conditions , to compute arc-consistency. Restricting to that case and integrating semiring-based constraint solving in the Constraint L...
متن کاملSemiring-based Constraint Logic Programming Content Areas: Constraint Satisfaction, Automated Reasoning
We extend the Constraint Logic Programming (CLP) formalism in order to handle semiring-based constraint systems. This allows us to perform in the same language both constraint solving and optimization. In fact, constraint systems based on semirings are able to model both classical constraint solving and more sophisticated features like uncertainty, probability , fuzzyness, and optimization. We ...
متن کاملEncoding global constraints in semiring-based constraint solving
In recent works, a general framework for constraint satisfaction over nite domains has been proposed, based on the concept of semiring-valued constraints. Classical CSPs, fuzzy CSPs, hierachical CSPs can be easily cast in this general framework. In this paper, we claim that translating any constraint problem into a semiring-based constraint problem makes it possible to express global in-formati...
متن کاملEnhancing Constraints Manipulation in Semiring-Based Formalisms
Many “semiring-like” structures are used in Soft Constraint Satisfaction Problems (SCSPs). We review a few properties of semirings that are useful for dealing with soft constraints, highlighting the differences between alternative proposals in the literature. We then extend the semiring structure by adding the notion of division as a weak inverse operation of product. In particular, division is...
متن کاملCoordinating Asynchronous and Open Distributed Systems under Semiring-Based Timing Constraints
For asynchronous and open distributed systems, dynamicity, openness, and stringent quality of service requirements post great challenges to model and develop such systems. The Actor-Role-Coordinator (ARC) model was previously proposed to address these challenges. The role concept in the model attends to the dynamicity and openness issues by providing abstractions of actor behaviors. In this pap...
متن کامل